A Locally Adaptive Data
نویسنده
چکیده
A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described. The scheme is based on a simple heuristic for self-organizing sequential search and on variable-length encodings of integers. We prove that it never performs much worse than Huffman coding and can perform substantially better; experiments on real files show that its performance is usually quite close to that of Huffman coding. Our scheme has many implementation advantages: it is simple, allows fast encoding and decoding, and requires only one pass over the data to be compressed (static Huffman coding takes huo passes).
منابع مشابه
Image Zooming using Non-linear Partial Differential Equation
The main issue in any image zooming techniques is to preserve the structure of the zoomed image. The zoomed image may suffer from the discontinuities in the soft regions and edges; it may contain artifacts, such as image blurring and blocky, and staircase effects. This paper presents a novel image zooming technique using Partial Differential Equations (PDEs). It combines a non-linear Fourth-ord...
متن کاملLocally Adaptive Perceptual Quantization without Sideinformation for Compression of Visual
This paper presents a locally-adaptive perceptual quanti-zation scheme for visual data compression. The strategy is to exploit human visual masking properties by deriving masking thresholds in a locally-adaptive fashion based on a sub-band decomposition. The derived masking thresholds are used in controlling the quantization stage by adapting the quantizer reconstruction levels to the local amo...
متن کاملAdopting the Multiresolution Wavelet Analysis in Radial Basis Functions to Solve the Perona-Malik Equation
Wavelets and radial basis functions (RBF) have ubiquitously proved very successful to solve different forms of partial differential equations (PDE) using shifted basis functions, and as with the other meshless methods, they have been extensively used in scattered data interpolation. The current paper proposes a framework that successfully reconciles RBF and adaptive wavelet method to solve the ...
متن کاملLocally Adaptive Nearest Neighbor Algorithms
Four versions of a k-nearest neighbor algorithm with locally adaptive k are introduced and compared to the basic k-nearest neighbor algorithm (kNN). Locally adaptive kNN algorithms choose the value of k that should be used to classify a query by consulting the results of cross-validation computations in the local neighborhood of the query. Local kNN methods are shown to perform similar to kNN i...
متن کاملA Survey on Joint Data-Hiding and Compression Techniques based on SMVQ and Improved Locally Adaptive Coding Method
Today Reversible data hiding is latest research area in the field of secret data hiding technique. Data hiding is a technique in which conceal secret data is hidden in some cover image like video, audio, movie, file, and image. Data hiding popularly used in medical and military application. This paper covers many hiding and compression techniques like vector quantization (VQ), side match vector...
متن کاملA Locally Adaptive Penalty for Estimation of Functions with Varying Roughness
We propose a new regularization method called Loco-Spline for nonparametric function estimation. Loco-Spline uses a penalty which is data driven and locally adaptive. This allows for more flexible estimation of the function in regions of the domain where it has more curvature, without over fitting in regions that have little curvature. This methodology is also transferred into higher dimensions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999